Papers with relaxed matching procedure
A Relaxed Matching Procedure for Unsupervised BLI (2020.acl-main)
Copied to clipboard
| Challenge: | Recent studies have shown that unsupervised bilingual lexicon induction is even on par with supervised methods. |
| Approach: | They propose a relaxed matching procedure to find a more precise matching between two languages by aligning source and target embedding space bidirectionally. |
| Outcome: | The proposed method significantly outperforms previous unsupervised methods on standard benchmarks. |